Solving location?allocation problems with professional optimization software
نویسندگان
چکیده
Location-allocation modeling has always been regarded as a core part of spatial analysis. A review the literature, however, reveals that, nevertheless, publications related to facility location disappeared almost completely from geographic journals in meantime. It can be assumed that one major reason for this development is limited capability location-allocation modules implemented GIS packages prevents software being used solve increasingly complex real-world problems today. The main purpose present article demonstrate how solved efficiently with professional optimization software, more precisely, two program CPLEX® and AIMMS®. Starting classic problems, viz., p $$ -median set covering problem, presents structurally much complicated which are far beyond capabilities respective modules, quite easily these packages.
منابع مشابه
Solving Optimization Problems with DLL
Propositional satisfiability (SAT) is a success story in Computer Science and Artificial Intelligence: SAT solvers are currently used to solve problems in many different application domains, including planning and formal verification. The main reason for this success is that modern SAT solvers can successfully deal with problems having millions of variables. All these solvers are based on the D...
متن کاملFOA: ‘Following’ Optimization Algorithm for solving Power engineering optimization problems
These days randomized-based population optimization algorithms are in wide use in different branches of science such as bioinformatics, chemical physics andpower engineering. An important group of these algorithms is inspired by physical processes or entities’ behavior. A new approach of applying optimization-based social relationships among the members of a community is investigated in this pa...
متن کاملSolving Geometric Optimization Problems
We show how to use graphics hardware for tackling optimization problems arising in the field of computational geometry. We exemplarily discuss three problems, where combinatorial algorithms are inefficient or hard to implement. Given a set S of n point in the plane, the first two problems are to determine the smallest homothetic scaling of a star shaped polygon P enclosing S and to find the lar...
متن کاملSolving Software Reuse Problems with Theorem Provers
For a challenging application, the software component retrieval , we present a powerful solution by combining two systems. The NORA/HAMMR-tool handles all aspects concerning with the logical representation of the application problem, the ILF-tool provides an infrastructure to apply several ATPs like SETHEO, OTTER, SPASS to the emerging deductive problems. For a fruitful practically application,...
متن کاملSolving equations and optimization problems with uncertainty
We study the problem of detecting zeros of continuous functions that are known only up to an error bound, extending the theoretical work of [FK15b] with explicit algorithms and experiments with an implementation. More formally, the robustness of zero of a continuous map f : X → R is the maximal r > 0 such that each g : X → R with ‖f − g‖∞ ≤ r has a zero. We develop and implement an algorithm ap...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions in Gis
سال: 2022
ISSN: ['1361-1682', '1467-9671']
DOI: https://doi.org/10.1111/tgis.12997